Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
221	There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-12-30 12:50:07 Dynamic programming Operations research Complexity classes Approximation algorithms Polynomial-time approximation scheme Knapsack problem Subset sum problem Parameterized complexity Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
222	Complexity Classes in the Two-dimensional Life Cellular Automata Subspace Michael Magnier Claude Lattaud Laboratoire d’Intelligence Artificielle de Paris V, Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-09-20 14:36:17 Physics Chaos theory Dynamical system Phase transition Nature Structure Rule 184 Rule 30 Cellular automaton Systems theory Cellular automata
223	Constraints DOIs10601The Complexity of Reasoning with Global Constraints Christian Bessiere · Emmanuel Hebrard · Brahim Hnich · Toby Walsh Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:29 Applied mathematics Mathematical optimization Local consistency Constraint satisfaction NP-complete Computational complexity theory P versus NP problem NP Complexity of constraint satisfaction Constraint programming Theoretical computer science Complexity classes
224	Arithmetic Circuits: a survey of recent results and open questions Amir Shpilka 1 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2011-03-10 13:51:53 Complexity classes Circuit complexity Arithmetic circuit complexity Mathematical optimization Polynomials Schwartz–Zippel lemma ACC0 Circuit PP Theoretical computer science Computational complexity theory Applied mathematics
225	On the (Im)possibility of Obfuscating Programs∗ Boaz Barak† Oded Goldreich‡ Amit Sahaik Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2012-08-02 17:50:31 Complexity classes Computability theory Theory of computation Pseudorandomness Models of computation Obfuscated code Oracle machine Algorithm P Theoretical computer science Computational complexity theory Applied mathematics
226	The Circuit-Input Game, Natural Proofs, and Testing Circuits With Data∗ Brynmor Chapman† Stanford University Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2014-12-10 16:56:25 Complexity classes Circuit complexity Pseudorandomness Computability theory Advice Pseudorandom generator ACC0 Natural proof Boolean circuit Theoretical computer science Computational complexity theory Applied mathematics
227	Non-Linear Time Lower Bound for (Succinct) Quantified Boolean Formulas Ryan Williams∗ Carnegie Mellon University Abstract Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2008-04-30 19:50:48 Complexity classes True quantified Boolean formula Alternating Turing machine FO DTIME NTIME Time complexity SL Turing machine Theoretical computer science Computational complexity theory Applied mathematics
228	Group Non-negative Matrix Factorization with Natural Categories for Question Retrieval in Community Question Answer Archives Guangyou Zhou, Yubo Chen, Daojian Zeng, and Jun Zhao National Laboratory of Pattern Recognition Add to Reading List Source URL: anthology.aclweb.org Language: English - Date: 2014-08-08 12:19:00 Matrix theory Numerical linear algebra Complexity classes Multivariate statistics NP Computational complexity theory Non-negative matrix factorization Learning to rank BM25 Algebra Mathematics Linear algebra
229	Improved Parameterized Algorithms for Network Query Problems Ron Y. Pinter, Hadas Shachnai, and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {pinter,hadas,meizeh}@cs.technion.ac.il Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-03-05 14:37:49 Complexity classes NP-complete problems Parameterized complexity Tree decomposition Dynamic programming NP-hard NP Clique problem Theoretical computer science Computational complexity theory Graph theory
230	Hilldale Lecture Series In pursuit of the traveling salesman: Mathematics at the limits of computation Add to Reading List Source URL: www.secfac.wisc.edu Language: English - Date: 2014-10-24 10:53:47 Applied mathematics Travelling salesman problem Mathematical optimization Complexity classes Combinatorial optimization Theoretical computer science Computational complexity theory Operations research

UPDATE